A Proof Presentation Suitable for Teaching Proofs
نویسندگان
چکیده
The paper addresses comprehensible proof presentation for teaching and learning that can be provided by an automated proof planner that is a component of the proof development environment mega. Starting from empirically discovered requirements for the comprehen-sibility of proofs we show that, given a proof plan representation of a proof, the problem of automatically presenting a mathematical proof in a comprehensible manner becomes feasible in a way that was impossible before. We show how, based on a proof plan, a structured presentation at the level of proof methods can be automatically constructed
منابع مشابه
The logical structures of theological proofs, with an emphasis on the proof of love to God
This article has no abstract.
متن کاملPresenting Proofs with Adapted Granularity
When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem provers, in contrast, present proofs usually at a fixed level of detail (also called granularity). Often these presentations are neither intended nor suitable for human use. A challenge therefore is to develop userand goal-...
متن کاملQuranic way of presenting proofs for God`s existence
Regardless of the view of those philosophers like Plantinga who see no need in any proof for the existence of God, scholars have presented four views on Quranic way of proving the existence of God including demonstration, awakening, implication and clear demonstration. Describing and criticizing the views in detail, the author has viewed differently. God has regarded the level of the addressee`...
متن کاملHuman-readable Machine-veriiable Proofs for Teaching Constructive Logic
A linear syntax for natural deduction proofs in rst-order in-tuitionistic logic is presented, which has been an eeective tool for teaching logic. The proof checking algorithm is also given, which is the core of the tutorial proof checker Tutch. This syntax is then extended to proofs on the assertion level which resemble single inferences one would make in a rigorous proof. The resulting languag...
متن کاملHuman-Readable Machine-Verifiable Proofs for Teaching Constructive Logic
A linear syntax for natural deduction proofs in first-order intuitionistic logic is presented, which has been an effective tool for teaching logic. The proof checking algorithm is also given, which is the core of the tutorial proof checker Tutch. This syntax is then extended to proofs on the assertion level which resemble single inferences one would make in a rigorous proof. The resulting langu...
متن کامل